Combinatorial optimization and Green Logistics

نویسندگان

  • Abdelkader Sbihi
  • Richard W. Eglese
چکیده

The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems. The paper particularly considers the topics of reverse logistics, waste management and vehicle routing and scheduling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chance-constrained problem with recourse. We show that the MKP is NP-hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assum...

متن کامل

Swarm intelligence applied in green logistics: A literature review

Green logistics (GL) is gaining increasing attention among academic researchers and industrial practitioners, due to the escalating deterioration of the environment. Various green activities and operations aiming at improving the performance of GL have been applied synthetically, and most of the activities can be modeled as combinatorial optimization (CO) problems. Exact approaches tend to be i...

متن کامل

Editorial for Volume 7 Number 2: Simulation human stampedes to improve decision making in Humanitarian Logistics

Ochoa, Alberto; Canul Reich, Juana; Acosta, Diego; Pozos, Pilar; González, Saúl; Ruíz, Miguel; Bernábe Loranca, Beatriz Simulation human stampedes to improve decision making in Humanitarian Logistics International Journal of Combinatorial Optimization Problems and Informatics, vol. 7, núm. 2, mayo-agosto, 2016, pp. 1-2 International Journal of Combinatorial Optimization Problems and Informatics...

متن کامل

The Computational Complexity of Stochastic Optimization

This paper presents an investigation on the computational complexity of stochastic optimization problems. We discuss a scenariobased model which captures the important classes of two-stage stochastic combinatorial optimization, two-stage stochastic linear programming, and two-stage stochastic integer linear programming. This model can also be used to handle chance constraints, which are used in...

متن کامل

Guest Editorial: Advanced Combinatorial Optimization and Applications

Biographical notes: Dr. Said Ben Messaoud received his Diploma of “Maîtrise” in Applied Mathematics from the Faculty of Sciences of Monastir in 1998, his MS degree from the INPGGrenoble, in 2000 and his PhD degree in Optimization in 2004 from the Technology University of Troyes. He is a Assistant Professor at the Higher Institute for Informatics and Mathematics of Monastir-Tunisia. His research...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 175  شماره 

صفحات  -

تاریخ انتشار 2007